Generating functions and congruences for 9-regular and 27-regular partitions in 3 colours
نویسندگان
چکیده
Let $b_{\ell;3}(n)$ denote the number of $\ell$-regular partitions $n$ in 3 colours. In this paper, we find some general generating functions and new infinite families congruences modulo arbitrary powers $3$ when $\ell\in\{9,27\}$. For instance, for positive integers $k$, have\begin{align*}b_{9;3}\left(3^k\cdot n+3^k-1\right)&\equiv0~\left(\mathrm{mod}~3^{2k}\right),\\b_{27;3}\left(3^{2k+3}\cdot n+\dfrac{3^{2k+4}-13}{4}\right)&\equiv0~\left(\mathrm{mod}~3^{2k+5}\right).\end{align*}
منابع مشابه
Congruences on Regular Semigroups
Let S be a regular semigroup and let p be a congruence relation on S. The kernel of p, in notation kerp, is the union of the idempotent p-classes. The trace of p, in notation trp, is the restriction of p to the set of idempotents of S. The pair (kerp,trp) is said to be the congruence pair associated with p. Congruence pairs can be characterized abstractly, and it turns out that a congruence is ...
متن کامل3-regular Partitions and a Modular K3 Surface
In classical representation theory, k-regular partitions of n label irreducible kmodular representations of the symmetric group Sn when k is prime [8]. More recently, such partitions have been studied for their arithmetic properties in connection with the theory of modular forms and Galois representations [1, 6, 10, 11, 12]. Although one may presumably use the ideas from [1, 10] to study the k-...
متن کاملClassifying ω-Regular Partitions
We try to develop a theory of ω-regular partitions in parallel with the theory around the Wagner hierarchy of regular ω-languages. In particular, we generalize a theorem of L. Staiger and K. Wagner to the case of partitions, prove decidability of all levels of the Boolean hierarchy of regular partitions over open sets, establish coincidence of reducibilities by continuous functions and by funct...
متن کاملRegular coding partitions
The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite sequences. We prove that the canonical codi...
متن کاملRegular languages and their generating functions: The inverse problem
The technique of determining a generating function for an unambiguous context-free language is known as the Schützenberger methodology. For regular languages, Elena Barcucci et al. proposed an approach for inverting this methodology based on Soittola’s theorem. This idea allows a combinatorial interpretation (by means of a regular language) of certain positive integer sequences that are defined...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hardy-Ramanujan Journal
سال: 2022
ISSN: ['2804-7370']
DOI: https://doi.org/10.46298/hrj.2022.8927